# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def threeSumClosest(self, nums: List[int], target: int) -> int:
        nums_length = len(nums)
        if nums_length <= 3:
            return sum(nums)

        ans = 0
        nums.sort()
        min_sums = 10 ** 4
        distance = 10 ** 4

        for i in range(nums_length):
            if i > 0 and nums[i] == nums[i-1]:
                continue

            l = i + 1
            r = nums_length - 1
            while l < r:
                nums_sum = nums[i] + nums[l] + nums[r]
                if abs(target - nums_sum) < distance:
                    distance = abs(target - nums_sum)
                    min_sums = nums_sum
                    if distance == 0:
                        return min_sums

                if nums_sum > target:
                    while l < r and nums[r] == nums[r-1]:
                        r = r - 1
                    r = r - 1
                else:
                    while l < r and nums[l] == nums[l-1]:
                        l = l + 1
                    l = l + 1

        return min_sums


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([0, 1,1,1,1,3,1,1, 100], 3, 3),
        ([0, 2, 1, -3], 1, 0),
        ([1,1,1,0], 100, 3),
        ([-1, 2, 1, -4], 1, 2)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.threeSumClosest(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

